Generating Random Binary Trees a Survey Generating Random Binary Trees a Survey Generating Random Binary Trees a Survey Erkki Mm Akinen
نویسنده
چکیده
This paper surveys algorithms for generating unbiased random binary trees. There exist several linear time algorithms. The best algorithms use only integers of size On to generate binary trees on n nodes.
منابع مشابه
Profile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملBinary Tree Code Words as Context-free Languages Binary Tree Code Words as Context-free Languages Erkki Mm Akinen
Given a binary tree coding system, the set of valid code words of all binary trees can be considered as a context-free language over the alphabet used in the coding system. The complexity of the language obtained varies from a coding system to another. Xiang, Tang and Ushijima have recently proved some properties of such languages. We show that their results can be more easily proved by noticin...
متن کاملGenerating Binary Trees at Random
Atkinson, M.D. and J.-R. Sack, Generating binary trees at random, Information Processing Letters 41 (1992) 21-23. We give a new constructive proof of the Chung-Feller theorem. Our proof provides a new and simple linear-time algorithm for generating random binary trees on n nodes; the algorithm uses integers no larger than 212.
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملA Comparison of Random Binary Tree Generators
This paper empirically compares five linear-time algorithms for generating unbiased random binary trees. More specifically, we compare the relative asymptotic performance of the algorithms in terms of the numbers of various basic operations executed on average per tree node. Based on these numbers a ranking of the algorithms, which depends on the operation weights, can be deduced. A definitive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998